Symmetrization of Binary Random Variables 2
نویسندگان
چکیده
A random variable Y is called an independent symmetrizer of a given random variable X if (a) it is independent of X and (b) the distribution of X + Y is symmetric about 0. In cases where the distribution of X is symmetric about its mean, it is easy to see that the constant random variable Y = EX is a minimum-variance independent symmetrizer. Taking Y to have the same distribution as X clearly produces a symmetric sum but it may not be of minimum variance. We say that a random variable X is symmetry resistant if the variance of any symmetrizer, Y , is never smaller than the variance of X . Let X be a binary random variable: PfX = ag = p and PfX = bg = q where a 6= b, 0 < p < 1, and q = 1 p. We prove that such a binary random variable is symmetry resistant if (and only if) p 6= 1=2. Note that the minimumvariance as a function of p is discontinuous at p = 1=2. Dropping the independence assumption, we show that the minimum-variance reduces to pq min(p; q)=2, which is a continuous function of p.
منابع مشابه
Symmetrization of Binary Random Variables
A random variable Y is called an independent symmetrizer of a given random variable X if (a) it is independent of X and (b) the distribution of X + Y is symmetric about 0. In cases where the distribution of X is symmetric about its mean, it is easy to see that the constant random variable Y = −EX is a minimum-variance independent symmetrizer. Taking Y to have the same distribution as −X clearly...
متن کاملMoments Tensors, Hilbert's Identity, and k-wise Uncorrelated Random Variables
In this paper we introduce a notion to be called k-wise uncorrelated random variables, which is similar but not identical to the so-called k-wise independent random variables in the literature. We show how to construct k-wise uncorrelated random variables by a simple procedure. The constructed random variables can be applied, e.g. to express the quartic polynomial (xTQx)2, where Q is an n×n pos...
متن کاملExtending Robustness and Randomization from Consensus to Symmetrization Algorithms
This work interprets and generalizes consensus-type algorithms as switching dynamics leading to symmetrization of some vector variables with respect to the actions of a finite group. We show how the symmetrization framework we develop covers applications as diverse as consensus on probability distributions (either classical or quantum), uniform random state generation, and open-loop disturbance...
متن کاملExtending robustness & randomization from Consensus to Symmetrization Algorithms
This work interprets and generalizes consensus-type algorithms as switching dynamics leading to symmetrization of some vector variables with respect to the actions of a finite group. We show how the symmetrization framework we develop covers applications as diverse as consensus on probability distributions (either classical or quantum), uniform random state generation, and open-loop disturbance...
متن کاملThe Symmetric Operation in a Free Pre-lie Algebra Is Magmatic
A pre-Lie product is a binary operation whose associator is symmetric in the last two variables. As a consequence its antisymmetrization is a Lie bracket. In this paper we study the symmetrization of the pre-Lie product. We show that it does not satisfy any other universal relation than commutativity. This means that the map from the free commutative-magmatic algebra to the free pre-Lie algebra...
متن کامل